A Reflection Principle for Three Vicious Walkers

نویسندگان

  • William Y. C. Chen
  • Donna Q. J. Dou
  • Terence Y. J. Zhang
چکیده

We establish a reflection principle for three lattice walkers and use this principle to reduce the enumeration of the configurations of three vicious walkers to that of configurations of two vicious walkers. In the combinatorial treatment of two vicious walkers, we make connections to two-chain watermelons and to the classical ballot problem. Precisely, the reflection principle leads to a bijection between three walks (L1, L2, L3) such that L2 intersects both L1 and L3 and three walks (L1, L2, L3) such that L1 intersects L3. Hence we find a combinatorial interpretation of the formula for the generating function for the number of configurations of three vicious walkers, originally derived by Bousquet-Mélou by using the kernel method, and independently by Gessel by using tableaux and symmetric functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotics for the number of walks in a Weyl chamber of type B

Abstract. We consider lattice walks in R confined to the region 0 < x1 < x2... < xk with fixed (but arbitrary) starting and end points. The walks are required to be ”reflectable”, that is, we assume that the number of paths can be counted using the reflection principle. The main result is an asymptotic formula for the total number of walks of length n for a general class of walks as n tends to ...

متن کامل

Asymptotics for Walks in a Weyl chamber of Type B ( extended abstract ) †

We consider lattice walks in R confined to the region 0 < x1 < x2... < xk with fixed (but arbitrary) starting and end points. The walks are required to be ”reflectable”, that is, we assume that the number of paths can be counted using the reflection principle. The main result is an asymptotic formula for the total number of walks of length n with fixed but arbitrary starting and end point for a...

متن کامل

Nonintersecting Lattice Paths on the Cylinder

Abstract. We show how a formula concerning “vicious walkers” (which basically are nonintersecting lattice paths) on the cylinder given by P.J. Forrester can be proved and generalized by using the Lindström–Gessel–Viennot method, after having things set up in the right way. We apply the corresponding results to the (thermodynamic limit of the) free energy of the “lock step model of vicious walke...

متن کامل

Lattice paths: vicious walkers and friendly walkers

In an earlier paper [4] the problem of vicious random walkers on a d-dimensional directed lattice was considered. \Vicious walkers" describes the situation in which two or more walkers arriving at the same lattice site annihilate one another. Accordingly, the only allowed con gurations are those in which contacts are forbidden. Alternatively expressed as a static rather than dynamic problem, vi...

متن کامل

Some results for directed lattice walkers in a strip

Using a transfer matrix method, we present some results for directed lattice walkers in a horizontal strip of finite width. Some cases with two walkers in a small width are solved exactly, as are a couple of cases with vicious walkers in a small width; a conjecture is made for a case with three walkers. We also derive the general transfer matrix for two walkers. Lastly, we examine the dependenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008